breadth first search การใช้

The level structure of a graph can be computed by a variant of breadth first search:
Suggest a simplified version of this approach : they augment the graph to be maximal planar and construct a breadth first search tree as before.
For solving those cases, I'd suggest maybe a breadth first search starting with the originally chosen point, and proceeding to neighbouring unsearched vertices?
Because the tree contains each positive rational number exactly once, a breadth first search of the tree provides a method of listing all positive rationals that is closely related to Farey sequences.
Jarvis and Shier describe a very similar algorithm using breadth first search in place of depth-first search; the advantage of depth-first search is that the strong connectivity analysis can be incorporated into the same search.